Compatibility and Conjugacy on Partial Arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compatibility and Conjugacy on Partial Arrays

Research in combinatorics on words goes back a century. Berstel and Boasson introduced the partial words in the context of gene comparison. Alignment of two genes can be viewed as a construction of two partial words that are said to be compatible. In this paper, we examine to which extent the fundamental properties of partial words such as compatbility and conjugacy remain true for partial arra...

متن کامل

Conjugacy on partial words

The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. In this paper, we examine to which extent some fundamental combinatorial properties of words, such as conjugacy, remain true for partial words. The motivation behind the notion o...

متن کامل

global results on some nonlinear partial differential equations for direct and inverse problems

در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...

Partial Sums in Multidimensional Arrays

This problem comes in two distinct avors In query mode preprocessing is allowed and q is a query to be an swered on line In o line mode we are given the array A and a set of d rectangles q qm and we must com pute the m sums A qi Partial sum is a special case of the classical orthogonal range searching problem Given n weighted points in d space and a query d rectangle q compute the cumulative we...

متن کامل

On Conjugacy of Languages

We say that two languages X and Y are conjugates if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated to this equation. For example, we characterize all sets which are conjugated via a two-element biprefix set Z, as well as all two-element sets which are conjugates. Mathematics Subject Classification. 68R15, 68Q70.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational and Mathematical Methods in Medicine

سال: 2016

ISSN: 1748-670X,1748-6718

DOI: 10.1155/2016/5010316